A Predicate/State Transformer Semantics for Bayesian Learning
نویسندگان
چکیده
منابع مشابه
Measure Transformer Semantics for Bayesian Machine Learning
The Bayesian approach to machine learning amounts to computing posterior distributions of random variables from a probabilistic model of how the variables are related (that is, a prior distribution) and a set of observations of variables. There is a trend in machine learning towards expressing Bayesian models as probabilistic programs. As a foundation for this kind of programming, we propose a ...
متن کاملA Predicate/State Transformer Semantics for Bayesian Learning
This paper establishes a link between Bayesian inference (learning) and predicate and state transformer operations from programming semantics and logic. Specifically, a very general definition of backward inference is given via first applying a predicate transformer and then conditioning. Analogously, forward inference involves first conditioning and then applying a state transformer. These def...
متن کاملA Predicate Transformer Semantics for a Concurrent Language of Refinement
Circus is a combination of Z and CSP; its chief distinguishing feature is the inclusion of the ideas of the refinement calculus. Our main objective is the definition of refinement methods for concurrent programs. The original semantic model for Circus is Hoare and He’s unifying theories of programming. In this paper, we present an equivalent semantics based on predicate transformers. With this ...
متن کاملBayesian Learning at the Syntax-Semantics Interface
Given a small number of examples of sceneutterance pairs of a novel verb, language learners can learn its syntactic and semantic features. Syntactic and semantic bootstrapping hypotheses both rely on cross-situational observation to hone in on the ambiguity present in a single observation. In this paper, we cast the distributional evidence from scenes and syntax in a unified Bayesian probablist...
متن کاملOn the equivalence of state transformer semantics and predicate transformer semantics
G. Plotkin and the author [13] have worked out the equivalence between state transformer semantics and predicate transformer semantics in a domain theoretical setting for programs combining nondeterminism and probability. Works of C. Morgan and co-authors [20], Keimel, Rosenbusch and Streicher [14, 15], already go in the same direction using only discrete state spaces. In fact, Keimel and Plotk...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2016
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2016.09.038